An Efficient Formulation of Age Comparisons in the DISCRETE Edit System

نویسندگان

  • Bor-Chung Chen
  • William E. Winkler
چکیده

The DISCRETE edit system, based on the Fellegi and Holt model [1976] of editing, contains two major components: edit generation and error localization. The set covering problem (SCP) is formulated with constraint matrices many times in both components. Therefore, an e cient set covering algorithm is critical to the overall performance of the DISCRETE edit system. The design of a set covering algorithm (Chen [1998]) provides a major performance improvement for the DISCRETE edit system. The size of the constraint matrices is a very important factor to have an e cient set covering algorithm. The age comparison approach described in Chen, Winkler, and Hemmig [2000] creates a huge number of new variables and edit rules in the set covering algorithm of the edit generation and error localization of the DISCRETE edit system. The dimension of the constraint matrices created is an increasing function of the number of variables and the number of edit rules. In this paper, we will describe an e cient formulation and simple implementation of the age comparisons in surveys that have the age eld.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An E cient Formulation of Age Comparisons in the DISCRETE Edit System

The DISCRETE edit system, based on the Fellegi and Holt model [1976] of editing, contains two major components: edit generation and error localization. The set covering problem (SCP) is formulated with constraint matrices many times in both components. Therefore, an e cient set covering algorithm is critical to the overall performance of the DISCRETE edit system. The design of a set covering al...

متن کامل

Implementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey

Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...

متن کامل

Using a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

متن کامل

A Comparison Study of ACS If-Then-Else, NIM, and DISCRETE Edit and Imputation Systems Using ACS Data

In any statistical surveys, the information gathered may contain inconsistent, incorrect, or missing data. These erroneous data need to be revised or lled in prior to data tabulations and retrieval. The revisions of the erroneous data should not a ect the statistical inferences of the data. The missing data, as well as some inconsistent or incorrect data, are easy to identify while others are n...

متن کامل

Numerical solution of base shear in high tensioned cable antenna

A finite element solution based on equevalent elements is proposed for the static and dynamic analysis of tallhigh tensioned cable antennas. To reduce high number of degrees of freedom in space frame body of a structure, a simple equivalent beam element is defined for each simulative substructure. This numerical procedure is applicable to analyze complex three dimensional assemblies of substruc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002